首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   165篇
  免费   100篇
  国内免费   9篇
  2021年   1篇
  2020年   1篇
  2019年   5篇
  2018年   2篇
  2017年   19篇
  2016年   17篇
  2015年   18篇
  2014年   31篇
  2013年   34篇
  2012年   12篇
  2011年   9篇
  2010年   10篇
  2009年   4篇
  2008年   4篇
  2007年   9篇
  2006年   10篇
  2005年   17篇
  2004年   9篇
  2003年   7篇
  2002年   7篇
  2001年   7篇
  2000年   8篇
  1999年   9篇
  1998年   3篇
  1997年   5篇
  1996年   3篇
  1994年   3篇
  1993年   3篇
  1992年   2篇
  1990年   3篇
  1988年   2篇
排序方式: 共有274条查询结果,搜索用时 218 毫秒
41.
基于USB接口技术对"通用雷达装备虚拟维修训练系统(URVMTS)"的人机交互系统进行研究,通过合理的软、硬件设计实现了系统的通用性。不同的实装操作部件经过适当的信号调理均可以通过该系统方便地实现与雷达虚拟样机之间的交互。着重介绍了交互系统的通用性设计与实现方法,包括系统的通用性设计方案,USB硬件电路的通用性设计及相应的软件开发。  相似文献   
42.
In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001  相似文献   
43.
后方油库整体生存概率分析计算   总被引:1,自引:1,他引:0  
针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。  相似文献   
44.
Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000  相似文献   
45.
In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000  相似文献   
46.
线导鱼雷导引弹道的动力学分析   总被引:1,自引:0,他引:1  
通过线导鱼雷常用导引方法—三点法、前置角法导引弹道的动力学分析 ,推导出不同方法下鱼雷旋回速率的解析表达式 ,并通过数字仿真对鱼雷线导导引弹道动力学特性进行探讨 ,明确了线导鱼雷导引弹道特性与导引方法之间的关系 .  相似文献   
47.
48.
运用改进的Topsis评估模型对反潜巡逻机的作战效能进行评估,主要是对指标权重的计算方法进行改进:综合考虑客观熵权和专家主观权重得到综合权重,通过客观的熵权信息来调整主观权重的偏差,使得反潜巡逻机作战效能的评价结果更为合理。实例分析表明,该方法能够主客观相结合,简单有效,具有一定的推广应用价值。  相似文献   
49.
通过离散Fourier变换,给出了一个频域极小化外推算法。该算法能较好地抑制噪声干扰,其计算量小,计算机仿真结果表明,该方法有良好的应用前景。  相似文献   
50.
介绍了在图形处理中,利用面向对象技术实现的平面图形对象拾取算法。与传统的以大量图像信息的存储为基础的位图存储方式下的图形对象拾取算法相比,本算法不但包括单个图形对象的拾取,而且也探讨了在复杂的图形组合下,如在图形重叠与覆盖的情况下进行多个图形对象拾取所需解决的算法难点。本算法对提高图像信息的存储效率和图形对象拾取的质量,对图像科学与面向对象技术的发展具有实际意义。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号